Sum-rank product codes and bounds on the minimum distance
نویسندگان
چکیده
The tensor product of one code endowed with the Hamming metric and rank is analyzed. This gives a which naturally inherits sum-rank metric. Specializing to cyclic skew-cyclic code, resulting turns out belong recently introduced family cyclic-skew-cyclic codes. A group theoretical description these codes given, after investigating semilinear isometries in Finally, generalization Roos Hartmann-Tzeng bounds for sum rank-metric established, as well new lower bound on minimum distance two constituting code.
منابع مشابه
Lower bounds on the minimum average distance of binary codes
Let β(n,M) denote the minimum average Hamming distance of a binary code of length n and cardinality M. In this paper we consider lower bounds on β(n,M). All the known lower bounds on β(n,M) are useful when M is at least of size about 2n−1/n. We derive new lower bounds which give good estimations when size of M is about n. These bounds are obtained using linear programming approach. In particula...
متن کاملUpper bounds on the minimum distance of spherical codes
We use linear programming techniques to obtain new upper bounds on the maximal squared minimum distance of spherical codes with fixed cardinality. Functions Qj(n, s) are introduced with the property that Qj(n, s) < 0 for some j > m iff the Levenshtein bound Lm(n, s) on A(n, s) = max{|W | : W is an (n, |W |, s) code} can be improved by a polynomial of degree at least m+1. General conditions on t...
متن کاملBounds on Minimum Rank Distances of Array Codes
Various bounds on minimum rank distances of linear block codes have been proposed. In this paper, we derive a Singleton bound on minimum rank distances of m-by-n array codes. Our Singleton bound not only applies to nonlinear codes, but also implies several previously proposed bounds as special cases. In addition, we derive one upper bound and one lower bound on the size of array codes which par...
متن کاملBounds for the minimum distance in constacyclic codes
In algebraic coding theory it is common practice to require that (n, q) = 1, where n is the word length and F = GF(q) is the alphabet. In this paper, which is about constacyclic codes, we shall stick to this practice too. Since linear codes have the structure of linear subspaces of F , an alternative description of constacyclic codes in terms of linear algebra appears to be another quite natura...
متن کاملMinimum distance and pseudodistance lower bounds for generalised LDPC codes
Abstract: Two different ways of obtaining generalized low-density parity-check codes are considered. Lower bounds on the minimum distance, stopping distance, and pseudodistance are derived for these codes using graph based analysis. These bounds are generalizations of Tanner’s bit-oriented and parity-oriented bound for simple LDPC codes. The new bounds are useful in predicting the performance o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2022
ISSN: ['1090-2465', '1071-5797']
DOI: https://doi.org/10.1016/j.ffa.2022.102013